The rewriting logic semantics project
نویسندگان
چکیده
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial” to find the right balance between abstraction and computational observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.
منابع مشابه
The Rewriting Logic Semantics Project: A Progress Report
Rewriting logic is an executable logical framework well suited for the semantic definition of languages. Any such framework has to be judged by its effectiveness to bridge the existing gap between language definitions on the one hand, and language implementations and language analysis tools on the other. We give a progress report on how researchers in the rewriting logic semantics project are n...
متن کاملSysVeritas: A Framework for Verifying IOPT Nets and Execution Semantics within Embedded Systems Design
We present a rewriting logic based technique for defining the formal executable semantics of a non-autonomous Petri net class, named Input-Output Place/Transition nets (IOPT nets), designed for model-based embedded system's development, according to the MDA initiative. For this purpose, we provide model-to-model transformations from ecore IOPT models to a rewriting logic specification in Maude....
متن کاملConnuent Rewriting Systems for Logic Programming Semantics Connuent Rewriting Systems for Logic Programming Semantics
We introduce the general notion of a Connuent LP-System, which is a rewriting system on the set of all logic programs over a signature L. Such a system is based on certain transformation rules and induces a semantics SEM in a natural way. We show that most of the well-known semantics for normal logic programs are induced by connuent LP-systems. Moreover, we show by introducing several new trans...
متن کاملVerifying Reachability-Logic Properties on Rewriting-Logic Specifications
Reachability Logic is a recently introduced formalism, which is currently used for defining the operational semantics of programming languages and for stating properties about program executions. In this paper we show how Reachability Logic can be adapted for stating properties of transition systems described by Rewriting-Logic specifications. We propose an automatic procedure for verifying Rew...
متن کاملFrom Rewriting Logic, to Programming Language Semantics, to Program Verification
Rewriting logic has proven to be an excellent formalism to define executable semantics of programming languages, concurrent or not, and then to derive formal analysis tools for the defined languages with very little effort, such as model checkers. In this paper we give an overview of recent results obtained in the context of the rewriting logic semantics framework K, such as complete semantics ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 373 شماره
صفحات -
تاریخ انتشار 2006